#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll mod = 1e9 + 7;
ll dp[100][100];

int main() {
    int n;
    cin >> n;
    n++;
    for (int i = 1; i <= n; i++)
        dp[1][n] = dp[n][1] = 1;
    for (int x = 1; x <= n; x++)
        for (int y = 1; y <= n; y++) {
            dp[x][y] = (dp[x - 1][y] + dp[x][y - 1]) % mod;
        }
    cout << dp[n][n];

    return 0;
}
